Partial-order reduction for general state exploring algorithms
نویسندگان
چکیده
منابع مشابه
Exploring the Scope for Partial Order Reduction
Partial order reduction methods combat state explosion by exploring only a part of the full state space. In each state a subset of enabled transitions is selected using well-established criteria. Typically such criteria are based on an upper approximation of dependencies between transitions. An additional heuristic is needed to ensure that currently disabled transitions stay disabled in the dis...
متن کاملPartial Order Reduction for State/Event LTL
Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL [6, 5] incorporates both states and events to express important properties of component-based software systems. The main contribution of the paper is a partial order reduction technique for ve...
متن کاملDistributed Partial Order Reduction of State Spaces
State space explosion is a fundamental obstacle in formal verification of concurrent systems. Several techniques for combating this problem have emerged in the past few years, among which the two we are interested in are: partial order reduction and distributed memory state exploration. While the first one tries to reduce the problem to a smaller one, the other one tries to extend the computati...
متن کاملTheory and Algorithms for Partial Order Based Reduction in Planning
Search is a major technique for planning. It amounts to exploring a state space of planning domains typically modeled as a directed graph. However, prohibitively large sizes of the search space make search expensive. Developing better heuristic functions has been the main technique for improving search efficiency. Nevertheless, recent studies have shown that improving heuristics alone has certa...
متن کاملA Framework for Combining State Interpolation and Partial Order Reduction
We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there is statebased interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Second, there are tracebased methods, collectively known as “Partia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2008
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-008-0093-y